import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2025-09-20
 * Time: 15:48
 */
public class Test3602 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for(int i = t; i > 0; i--) {
            int n  = sc.nextInt();
            int[] h = new int[n];
            for(int j = 0; j < n; j++) {
                h[j] = sc.nextInt();
            }

            int[] dp1 = new int[n];
            int[] dp2 = new int[n];
            dp1[0] = 1;
            dp2[0] = 1;

            int maxLen = 1;
            for(int k = 1; k < n; k++) {
                if(h[k] > h[k-1]) {
                    dp1[k] = dp1[k-1]+1;
                } else {
                    dp1[k] = 1;
                }
                dp2[k] = dp1[k];
                if(k >= 2 && h[k] > h[k-2]) {
                    dp2[k] = Math.max(dp2[k],dp2[k-1]+1);
                }
                maxLen = Math.max(maxLen,dp2[k]);
            }

            System.out.println(maxLen+1);
        }
    }

//    3
//            5
//            3 6 2 3 1
//            6
//            1 1 4 5 1 4
//            10
//            7 8 3 5 6 1 2 4 9 10
}
